A New Scheduling Protocol Design Based on Deficit Weighted Round Robin for QoS Support in IP Networks

We present a study of the e®ects of active queue management (AQM) on the average queue size in routers. In this work, three prominent AQM schemes are considered: packet classi ̄cation, checking service level agreements (SLA) and queue scheduling. This paper presents several adaptive resource sharing models that use a revenue criterion to allocate bandwidth in an optimal way. The models ensure QoS requirements of data °ows and, at the same time, maximize the total revenue by adjusting parameters of the underlying schedulers. De ̄cit round robin (DRR) and de ̄cit weighted round robin (DWRR) scheduling techniques have shown their ability in providing fair and weighted sharing of network resources for network devices. However, they are unable to use the total allocated network bandwidth even in burst tra±c. In this paper, we propose a negative-de ̄cit weighted round robin (N-DWRR) technique as a new packet scheduling discipline to improve the bandwidth utilization rate without increasing the total latency. A fully hardware packet scheduler has been implemented and veri ̄ed as part of an intellectual property core. This is motivated by the fact that the design and analysis of hardware/software architectures for such techniques requires new models and methods, which do not fall under the domain of traditional embedded-systems design.